Partitioning Graphs into Generalizeddominating

نویسندگان

  • Pinar Heggernes
  • Jan Arne Telle
  • No
چکیده

We study the computational complexity of partitioning the vertices of a graph into generalized dominating sets. Generalized dominating sets are param-eterized by two sets of nonnegative integers and which constrain the neighborhood N (v) of vertices. A set S of vertices of a graph is said to be a (;)-set if 8v 2 S : jN(v)\Sj 2 and 8v 6 2 S : jN(v)\Sj 2 .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design and Evaluation of a Method for Partitioning and Offloading Web-based Applications in Mobile Systems with Bandwidth Constraints

Computation offloading is known to be among the effective solutions of running heavy applications on smart mobile devices. However, irregular changes of a mobile data rate have direct impacts on code partitioning when offloading is in progress. It is believed that once a rate-adaptive partitioning performed, the replication of such substantial processes due to bandwidth fluctuation can be avoid...

متن کامل

Partitioning Perfect Graphs into Stars

The partition of graphs into “nice” subgraphs is a central algorithmic problem with strong ties to matching theory. We study the partitioning of undirected graphs into same-size stars, a problem known to be NPcomplete even for the case of stars on three vertices. We perform a thorough computational complexity study of the problem on subclasses of perfect graphs and identify several polynomial-t...

متن کامل

Partitioning Well-Clustered Graphs: Spectral Clustering Works!

In this work we study the widely used spectral clustering algorithms, i.e. partition a graph into k clusters via (1) embedding the vertices of a graph into a low-dimensional space using the bottom eigenvectors of the Laplacian matrix, and (2) partitioning the embedded points via k-means algorithms. We show that, for a wide class of graphs, spectral clustering algorithms give a good approximatio...

متن کامل

Partitioning networks into classes of mutually isolated nodes ?

Following the work of Newman, we model complex networks with random graphs of a given degree distribution. In particular we study the case where all vertices have exactly the same degree (random regular graphs). We survey some recent results on the problem of partitioning such a graph into the smallest possible number of classes of mutually isolated vertices, known in graph theory as the colora...

متن کامل

LEOPARD: Lightweight Edge-Oriented Partitioning and Replication for Dynamic Graphs

This paper introduces a dynamic graph partitioning algorithm, designed for large, constantly changing graphs. We propose a partitioning framework that adjusts on the fly as the graph structure changes. We also introduce a replication algorithm that is tightly integrated with the partitioning algorithm, which further reduces the number of edges cut by the partitioning algorithm. Even though the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998